Hierarchical Composition of Self-Stabilizing Protocols Preserving the Fault-Containment Property
نویسندگان
چکیده
A desired property of large distributed systems is self adaptability against the faults that occur more frequently as the size of the distributed system grows. Self-stabilizing protocols provide autonomous recovery from finite number of transient faults. Fault-containing selfstabilizing protocols promise not only self-stabilization but also containment of faults (quick recovery and small effect) against small number of faults. However, existing composition techniques for self-stabilizing protocols (e.g. fair composition) cannot preserve the fault-containment property when composing fault-containing self-stabilizing protocols. In this paper, we present Recovery Waiting Fault-containing Composition (RWFC) framework that provides a composition of multiple fault-containing selfstabilizing protocols while preserving the fault-containment property of the source protocols. key words: fault-containment, self-stabilization, composition
منابع مشابه
Preserving the Fault-Containment of Ring Protocols Executed on Trees
Reliable and fault-tolerant distributed systems have been attracting more and more attention (see Autonomic Computing Project by IBM, http://www-03.ibm.com/autonomic/). A self-stabilizing protocol is a fault-tolerant protocol that guarantees autonomous recovery from any number of and any type of faults that can affect the data stored locally at some process(es). If the impact of the faults can ...
متن کاملFault - Containment in Self - Stabilizing Distributed Systems
Self-stabilizing systems can automatically recover from arbitrary transient faults, and changes in the environment of the system, without any external intervention. However, in existing distributed self-stabilizing protocols, the performance of recovery is not linked to the severity of the fault. Recovery from failure at even a single component of the system may take a long time and aaect the o...
متن کاملTime-Efficient Self-Stabilizing Algorithms through Hierarchical Structures
We present a method of combining a self-stabilizing algorithm with a hierarchical structure to construct a self-stabilizing algorithm with improved stabilization time complexity and fault-containment features. As a case study, a self-stabilizing spanning-tree algorithm is presented which in favorable settings has logarithmic stabilization time complexity.
متن کاملA Self-stabilizing Link-Coloring Protocol Resilient to Unbounded Byzantine Faults in Arbitrary Networks
Self-stabilizing protocols can tolerate any type and any number of transient faults. However, in general, self-stabilizing protocols provide no guarantee about their behavior against permanent faults. This paper proposes a self-stabilizing link-coloring protocol resilient to (permanent) Byzantine faults in arbitrary networks. The protocol assumes the central daemon, and uses 2∆ − 1 colors where...
متن کاملScalable fault-containing self-stabilization in dynamic networks
Self-stabilizing distributed systems provide a high degree of non-masking fault-tolerance. They recover from transient faults of any scale or nature without human intervention. In general, however, the time needed to recover from small-scale transient faults may not differ significantly from the time needed to recover from large-scale transient faults. Bounding the impact of small-scale faults ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEICE Transactions
دوره 92-D شماره
صفحات -
تاریخ انتشار 2009